O ct 2 00 4 BRANCHING PROCESSES , AND RANDOM - CLUSTER MEASURES ON TREES
نویسنده
چکیده
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of ‘boundary condition’, namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of randomcluster measures are explored for certain classes of equivalence relations. In proving uniqueness, the following problem concerning branching processes is encountered and answered. Consider bond percolation on the family-tree T of a branching process. What is the probability that every infinite path of T , beginning at its root, contains some vertex which is itself the root of an infinite open sub-tree?
منابع مشابه
Branching Processes, and Random-cluster Measures on Trees
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of ‘boundary condition’, namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of randomcluster measures are explored for certain classes of equivalence relations. In proving uniqueness, the following problem concerning branching processes is enco...
متن کاملA Class of Multifractal Processes Constructed Using an Embedded Branching Process by Geoffrey Decrouez
We present a new class of multifractal process on R, constructed using an embedded branching process. The construction makes use of known results on multitype branching random walks, and along the way constructs cascade measures on the boundaries of multitype Galton–Watson trees. Our class of processes includes Brownian motion subjected to a continuous multifractal time-change. In addition, if ...
متن کاملOn the Variance of the Height of Random Binary Search Trees
Let Hn be the height of a random binary search tree on n nodes. We show that there exists a constant a = 4.31107. .. such that P { I Hn-a log n i > f log log n }-+ 0, where > 15a/ In 2 = 93 .2933. .. . The proof uses the second moment method and does not rely on properties of branching processes. We also show that Var{Hn } = O ((lag log n) 2). 1. Introduction. The height Hn of a random binary s...
متن کاملSe p 20 05 Random Trees , Lévy Processes and Spatial Branching Processes
Random trees. Random trees. The main goal of this work is to investigate the genealogical structure of continuous-state branching processes in connection with limit theorems for discrete Galton-Watson trees. Applications are also given to the construction and various properties of spatial branching processes including a general class of superprocesses. Our starting point is the recent work of L...
متن کامل2 O ct 2 00 6 A survey of random processes with reinforcement
The models surveyed include generalized Pólya urns, reinforced random walks, interacting urn models, and continuous reinforced processes. Emphasis is on methods and results, with sketches provided of some proofs. Applications are discussed in statistics, biology, economics and a number of other areas.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008